public class TestKdTree {

    public static void main(String[] args) {
//        String filename = args[0];
//        In in = new In(filename);

        KdTree kdtree = new KdTree();
//        while (!in.isEmpty()) {
//            double x = in.readDouble();
//            double y = in.readDouble();
//            Point2D p = new Point2D(x, y);
//            kdtree.insert(p);
//        }
//
//        kdtree.nearest(new Point2D(0.81, 0.3));

        System.out.println(kdtree.size());

        kdtree.insert(new Point2D(1,1));
        System.out.println(kdtree.size());

        kdtree.insert(new Point2D(2,1));
        System.out.println(kdtree.size());

        kdtree.insert(new Point2D(1,1));
        System.out.println(kdtree.size());

        kdtree.insert(new Point2D(1,1));
        System.out.println(kdtree.size());

        kdtree.insert(new Point2D(2,1));
        System.out.println(kdtree.size());

        kdtree.insert(new Point2D(1,1));
        System.out.println(kdtree.size());
    }

}
